Combining Higher-Order and First-Order Computation Using ρ-calculus: Towards a semantics of ELAN

نویسندگان

  • Horatiu Cirstea
  • Claude Kirchner
چکیده

The ρ-calculus permits to express in a uniform and simple way firstorder rewriting, λ-calculus and non-deterministic computations as well as their combination. In this paper, we present the main components of the ρ-calculus and we give a full first-order presentation of this rewriting calculus using an explicit substitution setting, called ρσ, that generalizes the λσ-calculus. The basic properties of the non-explicit and explicit substitution versions are presented. We then detail how to use the ρ-calculus to give an operational semantics to the rewrite rules of the ELAN language.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rewriting and Multisets in ρ-calculus and ELAN

The ρ-calculus is a new calculus that integrates in a uniform and simple setting first-order rewriting, λ-calculus and non-deterministic computations. The main design concept of the ρ-calculus is to make all the basic ingredients of rewriting explicit objects, in particular the notions of rule application and multisets of results. This paper describes the calculus from its syntax to its basic p...

متن کامل

The Rewriting Calculus as a Semantics of ELAN

Rewriting techniques are now recognized as a fundamental concept in many areas of computer science including mechanized theorem proving and operational semantics of programming languages. From a conceptual as well as operational point of view, the notion of rewrite rule application is crucial. It leads immediately to the concept of rewriting strategy which fully defines the way several rules ar...

متن کامل

The rewriting calculus as a semantics to strategy application. Application to ELAN

Objects like rewrite rules and strategies are of very general use and interest in computer science. They are especially useful when modeling inference based systems like logical frameworks, theorem provers, constraint solvers, expert systems, transition systems. In order to formalize the concept of rule application, we have designed a calculus of explicit rule application called the rewritingor...

متن کامل

The rewriting calculus - Part II

The ρ-calculus integrates in a uniform and simple setting first-order rewriting, λ-calculus and nondeterministic computations. Its abstraction mechanism is based on the rewrite rule formation and its main evaluation rule is based on matching modulo a theory T . We have seen in the first part of this work the motivations, definitions and basic properties of the ρ-calculus. This second part is fi...

متن کامل

-calculus Its Syntax and Basic Properties

calculus is a new calculus that integrates in a uniform and simple settings rst-order rewriting,-calculus and non-deterministic computations. This paper describes the calculus from its syntax to its basic properties in the untyped case. We show how it embeds rst-order rewriting and-calculus. Finally we shows how-calculus can be used to give an operational semantics to the rewrite based language...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999